Report on article: P=NP Linear programming formulation of the Traveling Salesman Problem

Document mentioned in title of this article was published in first version in 2004. In moment research was started version revised on 16.01.2006 was available and this article refers mainly to that version. At this moment newer version revised on 16.10.2006 is available, but main idea is same. This article contains formulation of TSP 2 problem. Then problem is modeled as Integer Linear Programming 3 and after this author claims that solution is equivalent to non-integer version of the same linear programming problem – non integer solution is presenting many solutions at once.